Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints
نویسندگان
چکیده
منابع مشابه
A Study on Trust Region Update Rules in Newton Methods for Large-scale Linear Classification
e main task in training a linear classier is to solve an unconstrained minimization problem. In applying an optimization method to obtain a model, typically we iteratively nd a good direction and then decide a suitable step size. Past developments of extending optimization methods for large-scale linear classication focus on nding the direction, but lile aention has been paid on adjustin...
متن کاملQuasi - Newton Trust - Region Method
The classical trust-region method for unconstrained minimization can be augmented with a line search that finds a point that satisfies the Wolfe conditions. One can use this new method to define an algorithm that simultaneously satisfies the quasi-Newton condition at each iteration and maintains a positive-definite approximation to the Hessian of the objective function. This new algorithm has s...
متن کاملTrust Region Newton Method for Large-Scale Logistic Regression
Large-scale logistic regression arises in many applications such as document classification and natural language processing. In this paper, we apply a trust region Newton method to maximize the log-likelihood of the logistic regression model. The proposed method uses only approximate Newton steps in the beginning, but achieves fast convergence in the end. Experiments show that it is faster than...
متن کاملNewton Methods For Large-Scale Linear Inequality-Constrained Minimization
Newton methods of the linesearch type for large-scale minimization subject to linear inequality constraints are discussed. The purpose of the paper is twofold: (i) to give an active–settype method with the ability to delete multiple constraints simultaneously and (ii) to give a relatively short general convergence proof for such a method. It is also discussed how multiple constraints can be add...
متن کاملStochastic Newton and Quasi-Newton Methods for Large Linear Least-squares Problems
We describe stochastic Newton and stochastic quasi-Newton approaches to efficiently solve large linear least-squares problems where the very large data sets present a significant computational burden (e.g., the size may exceed computer memory or data are collected in real-time). In our proposed framework, stochasticity is introduced in two different frameworks as a means to overcome these compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2019
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-019-00127-4